Diffusion limited aggregation on the Boolean lattice
نویسندگان
چکیده
منابع مشابه
Diffusion Limited Aggregation on the Boolean Lattice
In the Diffusion Limited Aggregation (DLA) process on on Z, or more generally Z, particles aggregate to an initially occupied origin by arrivals on a random walk. The scaling limit of the result, empirically, is a fractal with dimension strictly less than d. Very little has been shown rigorously about the process, however. We study an analogous process on the Boolean lattice {0, 1}, in which pa...
متن کاملSlippery diffusion-limited aggregation.
Colloidal particles that interact through strong, short-range, secondary attractions in liquids form irreversible "slippery" bonds that are not shear-rigid. Through event-driven simulations of slippery attractive spheres, we show that space-filling fractal clusters still emerge from the process of "slippery" diffusion-limited aggregation (DLA). Although slippery and classic DLA clusters have th...
متن کاملAdvection-diffusion-limited aggregation.
Much is known about diffusion-limited growth from a dilute suspension. The simplest and most famous model is diffusion-limited aggregation (DLA), in which random walkers are released one-by-one far away and become frozen where they first touch a growing fractal cluster. Real growth phenomena, such as mineral deposition in rocks, however, often involve multiple processes, such as advection-diffu...
متن کاملDiffusion-Limited Aggregation on Curved Surfaces
We develop a general theory of transport-limited aggregation phenomena occurring on curved surfaces, based on stochastic iterated conformal maps and conformal projections to the complex plane. To illustrate the theory, we use stereographic projections to simulate diffusionlimited-aggregation (DLA) on surfaces of constant Gaussian curvature, including the sphere (K > 0) and pseudo-sphere (K < 0)...
متن کاملDiffusion Limited Aggregation on a Cylinder
We consider the DLA process on a cylinder G × N. It is shown that this process “grows arms”, provided that the base graph G has small enough mixing time. Specifically, if the mixing time of G is at most log(2−ε) |G|, the time it takes the cluster to reach the m-th layer of the cylinder is at most of order m · |G| log log|G| . In particular we get examples of infinite Cayley graphs of degree 5, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2018
ISSN: 1050-5164
DOI: 10.1214/18-aap1392